The k ?path vertex cover: General bounds and chordal graphs
نویسندگان
چکیده
For an integer , a k-path vertex cover of graph is set that shares with every path subgraph order k in G. The minimum cardinality denoted by . We give estimates—mostly upper bounds—on terms various parameters, including degrees and the number vertices edges. problem also considered on chordal graphs planar graphs.
منابع مشابه
The k-path vertex cover of rooted product graphs
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...
متن کاملThe k-path vertex cover of some product graphs
For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if every path of order k inG contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is denoted by ψk(G). In this paper, we give some bounds and the exact values in special cases for ψk of the Cartesian, and lexicographic products of some graphs. Key–Words: Vertex co...
متن کاملMinimum k-path vertex cover
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملThe k-Path Vertex Cover in Product Graphs of Stars and Complete Graphs∗
For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is denoted by ψk(G). In this paper, we present the exact values of ψk in some product graphs of stars and complete graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2021
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22079